Slop based Partitioning for Vertical Fragmentation in Distributed Database System
نویسندگان
چکیده
A Vertical Partitioning is the process of dividing the attributes of a relation. Further, a good Vertical Partitioning puts frequently accessed attributes of the relation together in a fragment. Various researchers have proposed different algorithms for Vertical Partitioning. Still, there is a scope of improvement in previous algorithms for Vertical Partitioning. In this paper a new algorithm is proposed for Vertical Partitioning in Distributed Database System. The proposed algorithm is named as Slop Based Partitioning Algorithm (SBPA). This algorithm utilizes the Clustered Affinity Matrix (CAM), which is calculated from Attribute Usage Matrix (AUM) and Frequency Matrix (FM).
منابع مشابه
A Formal Approach to the Vertical Partitioning Problemin Distributed Database
The design of distributed databases is an optimization problem requiring solutions to several interrelated problems: data fragmentation, allocation, and local optimization. Each problem can be solved with several diierent approaches thereby making the distributed database design a very diicult task. Although there is a large body of work on the design of data fragmentation, most of them are eit...
متن کاملVertical Fragmentation in Databases Using Data-Mining Technique
A new approach to vertical fragmentation in relational databases is proposed using association rules, a data-mining technique. Vertical fragmentation can enhance the performance of database systems by reducing the number of disk accesses needed by transactions. By adapting Apriori algorithm, a design methodology for vertical partitioning is proposed. The heuristic methodology is tested using tw...
متن کاملA Vertical Partitioning Algorithm for Distributed Object Oriented Databases
Object Oriented Databases (OODB) is becoming popular day by day and being used in a large number of application domains. In order to support homogeneous distributed OODBs a clear understanding of partitioning of class and how to do it by using different partitioning algorithms is needed. In this paper an algorithm for vertical fragmentation in a model consisting of class and comprising of compl...
متن کاملVertical partitioning impact on performance and manageability of distributed database systems (A Comparative study of some vertical partitioning algorithms)
Users of distributed database systems often observe performance problems such as unexpectedly low throughput or high latency. Determining the cause of the performance problems can be very hard task. Bottlenecks can occur in any of the components through which the data flows: the applications, the operating systems, the network interfaces and hardware. Horizontal and vertical partitioning are im...
متن کاملVertical Fragmentation and Allocation in Distributed Deductive Database Systems
Although approaches for vertical fragmentation and data allocation have been proposed 13, 16], algorithms for vertical fragmentation and allocation of data and rules in distributed deductive database systems (DDDBSs) are lacking. In this paper, we present diierent approaches for vertical fragmentation of relations that are referenced by rules and an allocation strategy for rules and fragments i...
متن کامل